The triangulation of the given point set on the 2D-plane is the planar straight-line embedding of the graph whose vertices is exactly and set of its edges is maximal (with the most edge). Two important issues are being explored in this area. a) In how many ways can More
The triangulation of the given point set on the 2D-plane is the planar straight-line embedding of the graph whose vertices is exactly and set of its edges is maximal (with the most edge). Two important issues are being explored in this area. a) In how many ways can the given set of points be triangulated? b) Which triangulation is optimal based on the given particular feature? The first problem is an open problem, and except in special cases where it has a closed relation, a polynomial time algorithm for it has not been presented in general. The second problem is NP-HARD when the goal is to find a triangulation whose total edge length is the smallest (MWT). So research has been done to provide heuristic, meta heuristic, or approximation algorithms for it.
In this paper, a method is presented in which by constructing the intersection graph obtained from all the line segments obtained from all pairs of points of and then algorithms for generating all maximal independent sets (MIS) of the intersection graph is introduced. Furthermore, an algorithm is introduced for counting the number of maximal independent sets. This approach in which constructing intersection graph and converting any triangulation problem to the maximal independent set problem is a new approach for triangulation problem in both cases (a) and (b). Considering difficulties to design algorithms for problems (a) and (b) because of its geometric natures, all the algorithms that have been proposed so far for problems (a) and (b) can be used to solve the triangulation problems in both cases by the approach proposed in this article. The proposed approach of converting triangulation problem to the MIS problem is a new approach that has never been reported to solve counting the number of triangulations or minimum weight triangulation. Furthermore a heuristic estimation algorithm will be introduced to estimate average number of triangulations on the given point set and the algorithm implementation shows its outputs is near to exact values for some instances.
Manuscript profile
